package ru.ifmo.contest.games;

import java.io.*;
import java.util.*;

/**
 * @author avhaliullin
 */

public class TaskA {
    FastScanner in;
    PrintWriter out;

    public void solve() throws IOException {
        int n = in.nextInt();
        int m = in.nextInt();
        Node[] nodes = new Node[n];
        for (int i = 0; i < n; i++) {
            nodes[i] = new Node();
        }
        boolean[] hasChildren = new boolean[n];
        for (int i = 0; i < m; i++) {
            int from = in.nextInt() - 1;
            int to = in.nextInt() - 1;
            hasChildren[from] = true;
            nodes[from].children.add(nodes[to]);
            nodes[to].parent.add(nodes[from]);
        }
        Queue<Node> queue = new LinkedList<Node>();
        for (int i = 0; i < n; i++) {
            if (!hasChildren[i]) {
                nodes[i].state = State.LOOSE;
                queue.offer(nodes[i]);
            }
        }

        while (!queue.isEmpty()) {
            Node current = queue.poll();
            if (State.LOOSE.equals(current.state)) {
                for (Node parent : current.parent) {
                    parent.state = State.WIN;
                    queue.offer(parent);
                }
            } else {
                for (Node parent : current.parent) {
                    if (!parent.children.remove(current)) {
                        continue;
                    }
                    if (parent.children.isEmpty()) {
                        parent.state = State.LOOSE;
                        queue.offer(parent);
                    }
                }
            }
        }
        for (Node node : nodes) {
            if (State.LOOSE.equals(node.state)) {
                out.println("Loss");
            }
            if (State.WIN.equals(node.state)) {
                out.println("Win");
            }
            if (node.state == null) {
                out.println("Draw");
            }
        }

    }

    public void run(String fileName) {
        try {
            in = new FastScanner(new File(fileName + ".in"));
            out = new PrintWriter(new File(fileName + ".out"));

            solve();

            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    class Node {
        Set<Node> parent = new HashSet<Node>();
        Set<Node> children = new HashSet<Node>();
        State state;
    }

    enum State {
        WIN,
        LOOSE
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
    }

    public static void main(String[] arg) {
        new TaskA().run("graphgame");
    }
}
